Logistica-cfp: an Implementation of Constraint Functional Programming
نویسنده
چکیده
As an alternative to constraint logic programming (CLP), LOGISTICA-CFP implements constraint functional programming (CFP) by borrowing from the approach of SCREAMER and building on the nondeterministic functional programming language LOGISTICA. Although currently in the experimental stages, LOGISTICA-CFP demonstrates that a functional approach can be used to implement constraint programming in a manner that can be expected to have the same advantages over CLP as SCREAMER while avoiding the imperative interface to constraint reasoning, yet allowing easy extension of the reasoning mechanism and integration with other symbolic reasoning applications.
منابع مشابه
Constraint Functional
In this paper, we present the framework of constraint functional programming (CFP) for constructing constraint systems over functional programs. The idea is that functional programs can be used in a multiple way either to evaluate expressions or to solve constraints. The ability to solve constraints provides CFP with the novel feature of computing queries over functional programs. A constraint ...
متن کاملCooperative Constraint Functional Logic Programming
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed constraint solving. FLP provides support for defining one’s own abstractions (user-defined functions and predicates) over a constraint domain in an easy and comfortable way, whereas CCS...
متن کاملType Inference for Programming Languages: A Constraint Logic Programming Approach
In this paper we present an application of Constraint Logic Programming to the design and implementation of type inference algorithms for programming languages. We present implementations in Prolog and Constraint Handling Rules (CHR) of several algorithms which belong to the state of the art of type inference for programming languages: the Damas-Milner type system, the Ohory system for labeled ...
متن کاملConstraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...
متن کاملCompiling Multi-Paradigm Declarative Programs into Prolog
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of Curry, is obtained by transforming Curry programs into Prolog programs. Contrary to previous transformations of functional logic programs into Prolog, our implementation includes new mechanisms for both efficiently p...
متن کامل